BVA+ - A Bit Vectors Algorithm for Accelerating Queries in Multilevel Secure Databases

نویسندگان

  • Ramzi A. Haraty
  • Arda Zeitunlian
چکیده

Much research has been done in the area of multilevel database systems, especially in the security area and accelerating queries. In this paper, we present BVA, which is based on bit vectors to accelerate queries in multilevel secure database systems. As its predecessor (BVA), the BVA algorithm follows the classic Sea View Model, but it recovers query output from single-level relations in a faster and more space-efficient manner than the previous works performed on this subject. In addition, the BVA algorithm does not produce spurious or extra tuples, which have always been a major problem in the area of multilevel secure

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accelerating Multilevel Secure Database Queries using P-Tree Technology

In the early 1990s, a lot of research was conducted in the area of multi-level secure database systems. Most of the work was directed towards the security aspect without much concentration on query acceleration. In this paper, a P-tree [1] based algorithm using the Sea View model [5] for multilevel relations is presented to accelerate queries in multilevel secure database systems. This algorith...

متن کامل

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

Data Structures for Accelerating Tanimoto Queries on Real Valued Vectors

Previous methods for accelerating Tanimoto queries have been based on using bit strings for representing molecules. No work has gone into examining accelerating Tanimoto queries on real valued descriptors, even though these offer a much more fine grained measure of similarity between molecules. This study utilises a recently discovered reduction from Tanimoto queries to distance queries in Eucl...

متن کامل

A Practical Transaction Model and Untrusted Transaction Manager for a Multilevel-Secure Database System

A new transaction model for multilevel-secure databases which use the replicated architecture is presented. A basic concurrency control algorithm and two variations are given based on this transaction model. We also present new correctness criteria for multilevel-secure databases which use the replicated architecture. Based on this criteria, we prove that our algorithms are correct. Keyword Cod...

متن کامل

بهبود الگوریتم انتخاب دید در پایگاه داده‌‌ تحلیلی با استفاده از یافتن پرس‌ وجوهای پرتکرار

A data warehouse is a source for storing historical data to support decision making. Usually analytic queries take much time. To solve response time problem it should be materialized some views to answer all queries in minimum response time. There are many solutions for view selection problems. The most appropriate solution for view selection is materializing frequent queries. Previously posed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004